From spin vertex to string vertex

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Meromorphic open-string vertex algebras

A notion of meromorphic open-string vertex algebra is introduced. A meromorphic open-string vertex algebra is an open-string vertex algebra in the sense of Kong and the author satisfying additional rationality (or meromorphicity) conditions for vertex operators. The vertex operator map for a meromorphic open-string vertex algebra satisfies rationality and associativity but in general does not s...

متن کامل

Particle - Particle - String Vertex 1

We study a theory of particles interacting with strings. Considering such a theory for Type IIA superstring will give some clue about M-theory. As a first step toward such a theory, we construct the particle-particle-string interaction vertex generalizing the D-particle boundary state. A talk given at Kashikojima Workshop, August 19September 1, 1996.

متن کامل

Comma Vertex and String Field Algebra

We study the matter part of the algebra of open string fields using the 3-string vertex over the sliver state, which we call “comma vertex”. By generalizing this comma vertex to the N -string overlap, we obtain a closed form of the Neumann coefficients in the N -string vertex and discuss its relation to the oscillator representation of wedge states.

متن کامل

Vertex-to-vertex pursuit in a graph

A graph G is given and two players, a cop and a robber, play the folioking game: the cop chooses a vertex, then the robber chooses a vertex, then the players move alternately beginning with the cop. A move consists of staying at one’s present vertex or moving to an adjacent vertex; each move is seen by both players. The cop wins if he manages to occupy the same vertex as the robber, and the rob...

متن کامل

Constructing vertex decomposable graphs

‎Recently‎, ‎some techniques such as adding whiskers and attaching graphs to vertices of a given graph‎, ‎have been proposed for constructing a new vertex decomposable graph‎. ‎In this paper‎, ‎we present a new method for constructing vertex decomposable graphs‎. ‎Then we use this construction to generalize the result due to Cook and Nagel‎.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of High Energy Physics

سال: 2015

ISSN: 1029-8479

DOI: 10.1007/jhep06(2015)172